The Generation of Pseudo-Triangulated Spiral Polygon Using Convex Hull Layers
نویسندگان
چکیده
The generation of random simple polygon and the pseudo-triangulation of a polygon are regarded as the proposed problems in computational geometry. The production of a random polygon is used in the context of the consideration of the accuracy of algorithms. In this paper, a new algorithm is presented to generate a simple spiral polygon on a set of random points S in the plane using convex hull layers in a way that pseudo-triangulation is also performed on it simultaneously. The new algorithm can be done in O(nlogn) time, so it is considered as one of the optimal algorithms.
منابع مشابه
Minimum Pseudo-Triangulation Using Convex Hull Layers
Pseudo-triangulation is regarded as one of the most commonly used problems in computational geometry. In this paper we consider the problem of minimum pseudotriangulation of a given set of points S in the plane using convex hull layers and we propose two new methods that will lead to the production of minimum pseudo-triangulation. This means that the number of pseudo-triangles created in minimu...
متن کاملFlipping edge-labelled triangulations
Flips in triangulations have received a lot of attention over the past decades. However, the problem of tracking where particular edges go during the flipping process has not been addressed. We examine this question by attaching unique labels to the triangulation edges. We introduce the concept of the orbit of an edge e, which is the set of all edges reachable from e via flips. We establish the...
متن کاملEnumerating pseudo-triangulations in the plane
A pseudo-triangle is a simple polygon with exactly three convex vertices. A pseudo-triangulation of a finite point set S in the plane is a partition of the convex hull of S into interior disjoint pseudo-triangles whose vertices are points of S. A pointed pseudo-triangulation is one which has the least number of pseudo-triangles. We study the graph G whose vertices represent the pointed pseudo-t...
متن کاملFlips in Edge-Labelled Pseudo-Triangulations
We show that O(n) exchanging flips suffice to transform any edge-labelled pointed pseudo-triangulation into any other with the same set of labels. By using insertion, deletion and exchanging flips, we can transform any edge-labelled pseudo-triangulation into any other with O(n log c+h log h) flips, where c is the number of convex layers and h is the number of points on the convex hull.
متن کاملDecomposing a simple polygon into pseudo-triangles and convex polygons
In this paper we consider the problem of decomposing a simple polygon into subpolygons that exclusively use vertices of the given polygon. We allow two types of subpolygons: pseudo-triangles and convex polygons. We call the resulting decomposition PTconvex. We are interested in minimum decompositions, i.e., in decomposing the input polygon into the least number of subpolygons. Allowing subpolyg...
متن کامل